Flowing Water Algorithm: A New Approach for Combinatorial Optimization Problems
نویسندگان
چکیده
Being greatly inspired by the natural flowing regulation of water, we propose a new meta-heuristic algorithm — Flowing Water Algorithm (FWA) for solution combinatorial optimization problems (COPs). Since space COPs is multidimensional, complex and has many local extreme values, according to our proposed method, it appears be similar an endless hilly area with mountains, valleys plateaus. The downward-flowing water in such finds its way lowest point hill. always flows downward eventually converges at place without any outside intervention except gravity. Such course can deemed as process seek point. derived from flow process. This combines search strategy population-based improve both global abilities. Four operators, including search, overflow, drilling tunnel evaporation-rain are included FWA, making this successfully perform tabu positive feedback, “survival fittest”, optimum escape. Two examples application traveling salesman problem (TSP) show that FWA outperforms benchmark methods quality convergence speed.
منابع مشابه
A New Optimization Algorithm For Combinatorial Problems
Combinatorial optimization problems are those problems that have a finite set of possible solutions. The best way to solve a combinatorial optimization problem is to check all the feasible solutions in the search space. However, checking all the feasible solutions is not always possible, especially when the search space is large. Thus, many meta-heuristic algorithms have been devised and modifi...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولCombinatorial Optimization Problems for Which Almostevery Algorithm
Consider a class of optimization problems for which the cardinality of the set of feasible solutions is m and the size of every feasible solution is N. We prove in a general probabilistic framework that the value of the optimal solution and the value of the worst solution are asymptotically almost surely (a.s.) the same provided log m = o(N) as N and m become large. This result implies that for...
متن کاملA New Local Search Based Ant Colony Optimization Algorithm for Solving Combinatorial Optimization Problems
Ant Colony Optimization (ACO) algorithms are a new branch of swarm intelligence. They have been applied to solve different combinatorial optimization problems successfully. Their performance is very promising when they solve small problem instances. However, the algorithms’ time complexity increase and solution quality decrease for large problem instances. So, it is crucial to reduce the time r...
متن کاملA New Algorithm for Constructing the Pareto Front of Bi-objective Optimization Problems
Here, scalarization techniques for multi-objective optimization problems are addressed. A new scalarization approach, called unified Pascoletti-Serafini approach, is utilized and a new algorithm to construct the Pareto front of a given bi-objective optimization problem is formulated. It is shown that we can restrict the parameters of the scalarized problem. The computed efficient points provide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American journal of mechanical and industrial engineering
سال: 2022
ISSN: ['2575-6079', '2575-6060']
DOI: https://doi.org/10.11648/j.ajmie.20220703.12